On Definability in Multimodal Logic
نویسندگان
چکیده
Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, reducibility, is introduced; it is shown that in multimodal logics, explicit definability is equivalent to the combination of implicit definability and reducibility. The three notions of definability are characterized semantically using (modal) algebras. The use of algebras, rather than frames, is shown to be necessary for these characterizations. ∗We thank Samson Abramsky, Arnon Avron, Johan van Benthem, Sergiu Hart, Martin Meier, Jouku Väänänen, and an anonymous reviewer for helpful discussions. †Supported in part by NSF under grants TR-0325453 and IIS-0534064, and by AFOSR under grant FA9550-05-1-0055. ‡Support by the Israeli Science Foundation under grant 891/04 is acknowledged.
منابع مشابه
On Definability in Multimodal Logic II. Defining Knowledge in Terms of Belief∗
The question of whether knowledge is definable in terms of belief, which has played an important role in epistemology for the last fifty years, is studied here in the framework of epistemic and doxastic logics. Three notions of definability are considered: explicit definability, implicit definability, and reducibility, where explicit definability is equivalent to the combination of implicit def...
متن کاملProbability Logic for Harsanyi Type Spaces
Probability logic has contributed to significant developments in belief types for game-theoretical economics. We present a new probability logic for Harsanyi Type spaces, show its completeness, and prove both a denesting property and a unique extension theorem. We then prove that multi-agent interactive epistemology has greater complexity than its single-agent counterpart by showing that if the...
متن کاملA Multimodal Logic Approach to Order of Magnitude Qualitative Reasoning with Comparability and Negligibility Relations
Non-classical logics have proven to be an adequate framework to formalize knowledge representation. In this paper we focus on a multimodal approach to formalize order-of-magnitude qualitative reasoning, extending the recently introduced system MQ, by means of a certain notion of negligibility relation which satisfies a number of intuitively plausible properties, as well as a minimal axiom syste...
متن کاملGlobal Definability in Basic Modal Logic
We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Rew. Symb. Logic
دوره 2 شماره
صفحات -
تاریخ انتشار 2009